The Space Complexity of Undirected Graph Exploration
نویسندگان
چکیده
Abstract We review the space complexity of deterministically exploring undirected graphs. assume that vertices are indistinguishable and edges have a locally unique color guides traversal space-constrained agent. The graph is considered to be explored once agent has visited all vertices. visit results for this setting showing $$\varTheta \,(\log n)$$ Θ ( log n ) bits memory necessary sufficient an explore n -vertex then illustrate that, if agents only sublogarithmic memory, number (distinguishable) needed collaborative exploration \log .
منابع مشابه
Time-Space Tradeoffs for Undirected Graph Traversal
We prove time-space tradeoffs for traversing undirected graphs. One of these is a quadratic lower bound on a deterministic model that closely matches the recent probabilistic upper bound of Broder, Karlin, Raghavan, and Upfal. The models used are variants of Cook and Rackoff’s “Jumping Automata for Graphs”. 1 The Complexity of Graph Traversal Graph traversal is a fundamental problem in computin...
متن کاملTime-Space Tradeoffs for Undirected Graph Traversal by Graph Automata
We investigate time-space tradeoffs for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Rackoff's ``Jumping Automata for Graphs.'' Our strongest tradeoff is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depth-first search is optimal. Since ...
متن کاملUndirected Graph Exploration with ⊝(log log n) Pebbles
We consider the fundamental problem of exploring an undirected and initially unknown graph by an agent with little memory. The vertices of the graph are unlabeled, and the edges incident to a vertex have locally distinct labels. In this setting, it is known that Θ(logn) bits of memory are necessary and sufficient to explore any graph with at most n vertices. We show that this memory requirement...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولThe Main Eigenvalues of the Undirected Power Graph of a Group
The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-21534-6_8